Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
161	Efficient CNF Simplification based on Binary Implication Graphs⋆ Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-06-03 17:52:43 Propositional calculus Automated theorem proving Mathematical logic Logic in computer science NP-complete problems Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Logic Mathematics
162	Symbiosis of Search and Heuristics for Random 3-SAT Sid Mijnders, Boris de Wilde, and Marijn J. H. Heule ! Delft University of Technology, Delft, The Netherlands Abstract. When combined properly, search techniques can re Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:06:00 Graph theory Binary trees Heuristic function Heuristics Heuristic Boolean satisfiability problem Depth-first search Binary search tree Tree traversal Theoretical computer science Mathematics Search algorithms
163	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:39 NP-complete problems Logic in computer science Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Conjunctive normal form Search algorithm Unit propagation Theoretical computer science Applied mathematics Mathematics
164	Blocked Clause Elimination Matti J¨arvisalo1 , Armin Biere2 , and Marijn Heule 3 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-12-21 10:55:55 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Theoretical computer science Mathematics Applied mathematics
165	SOLVING THE SATISFIABILITY PROBLEM USING MESSAGE-PASSING TECHNIQUES S. J. Pumphrey, May[removed]Part III Physics Project Report) A Bayesian message-passing technique, the sum-product algorithm, is described and applied to Add to Reading List Source URL: www.inference.phy.cam.ac.uk Language: English - Date: 2001-06-07 06:04:05 Constraint programming Probability theory Boolean satisfiability problem Electronic design automation Logic in computer science Local search Bayesian inference Algorithm Conjunctive normal form Mathematics Theoretical computer science Applied mathematics
166	Blocked Clause Decomposition Marijn J. H. Heule? and Armin Biere?? The University of Texas at Austin and Johannes Kepler University Linz Abstract. We demonstrate that it is fairly easy to decompose any propositional form Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:11:30 Automated theorem proving Propositional calculus Boolean algebra Mathematical logic Logic in computer science Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Mathematics Logic
167	Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:31:27 Boolean algebra Symmetry Logic in computer science NP-complete problems Electronic design automation Boolean satisfiability problem True quantified Boolean formula Conjunctive normal form Symmetry in mathematics Theoretical computer science Mathematics Applied mathematics
168	Dynamic Symmetry Breaking by Simulating Zykov Contraction Bas Schaafsma, Marijn Heule! and Hans van Maaren Department of Software Technology, Delft University of Technology [removed], [removed], h.van Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-04-21 07:17:46 Graph coloring NP-complete problems Complexity classes Boolean satisfiability problem SL 2-satisfiability Greedy coloring Theoretical computer science Graph theory Mathematics
169	Marijn J.H. Heule December 21, 2014 Personal Information Name: Born: Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-12-21 16:31:34 Logic in computer science Boolean algebra Constraint programming Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem Satisfiability Solver Theoretical computer science Mathematics Applied mathematics
170	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Tom´ aˇs Balyo1 , Andreas Fr¨ohlich2 , Marijn J. H. Heule3 , Armin Biere2 ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 10:00:09 Automated theorem proving Logic in computer science Propositional calculus NP-complete problems Logic programming Boolean satisfiability problem Unit propagation Conjunctive normal form Resolution Theoretical computer science Mathematics Mathematical logic

UPDATE